package bin_tree.seachtree;

/**
 * @author 是阿秋啊
 * @date 2022/03/21 14:05
 **/
public class BSTTest {
    public static void main(String[] args) {
        int[] data = {41,58,50,60,42,53,59,63};
        BST bst = new BST();
        for (int i : data) {
            bst.add(i);
        }
//        System.out.println(bst.contains(10));
//        System.out.println(bst.contains(42));
//        System.out.println(bst.findMax());
//        System.out.println(bst.findMin());
//        System.out.println(bst.removeMin());
//        System.out.println("-------------------");
//        System.out.println(bst);
//        System.out.println(bst.removeMax());
//        System.out.println("-------------------");
//        System.out.println(bst);
        System.out.println("-----------------------");
        bst.remove(58);
        System.out.println(bst);
    }
}
